Isohedra with nonconvex faces
نویسندگان
چکیده
منابع مشابه
Isohedra with Nonconvex Faces
An isohedron is a 3-dimensional polyhedron all faces of which are equivalent under symmetries of the polyhedron. Many well known polyhedra are isohedra; among them are the Platonic solids, the polars of Archimedean polyhedra, and a variety of polyhedra important in crystallography. Less well known are isohedra with nonconvex faces. We establish that such polyhedra must be starshaped and hence o...
متن کاملParallelogram-faced isohedra with edges in mirror-planes
Regular (or Platonic) polyhedra have been studied since antiquity, and many other kinds of polyhedra with various symmetry properties have been investigated since then. These include the traditional Archimedean polyhedra (regular-faced with congruent vertex gures), isohedra (polyhedra with faces all equivalent under symmetries of the polyhedron), isogonal polyhedra (all vertices of which are eq...
متن کاملScanning Faces Surroudings - New Concept in 3D Exact Multiviews of Nonconvex Polyhedron Generation
This article concerns generating of 3D multiview exact models that are a complete representation of polyhedron, according to viewing sphere with perspective projection. Those models are going to be used for visual identification based on them and a scene depth map. We give a new concept and an algorithm for face-depended generation of multi-face views. It does not require any preprocessing nor ...
متن کاملConvex Optimization with Nonconvex Oracles
In machine learning and optimization, one often wants to minimize a convex objective function F but can only evaluate a noisy approximation F̂ to it. Even though F is convex, the noise may render F̂ nonconvex, making the task of minimizing F intractable in general. As a consequence, several works in theoretical computer science, machine learning and optimization have focused on coming up with pol...
متن کاملSparse Reduced Rank Regression With Nonconvex Regularization
In this paper, the estimation problem for sparse reduced rank regression (SRRR) model is considered. The SRRR model is widely used for dimension reduction and variable selection with applications in signal processing, econometrics, etc. The problem is formulated to minimize the least squares loss with a sparsity-inducing penalty considering an orthogonality constraint. Convex sparsity-inducing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Geometry
سال: 1998
ISSN: 0047-2468,1420-8997
DOI: 10.1007/bf01221240